Metaheuristic Approach Based on Neighbourhood Search for Solving P-Median Problem
نویسندگان
چکیده
منابع مشابه
Simulated Annealing Metaheuristic for Solving P -Median Problem
We present an efficient metaheuristic based on Simulated Annealing for solving the p-Median problem. These ideas are tested on the well known OR-Lib set of problems with excellent results.
متن کاملHybridization of Neighbourhood Search Metaheuristic with Data Mining Technique to Solve p-median Problem
Combinatorial optimizat ion is the most panoptic area in current research paper. The p-median problem which is a combinatorial optimization problem is NP-Hard in nature that realizes facilitators which serves the maximum locations. The p-median problem will be pract ical in several applicat ions areas such as escalating marketing strategies in the sphere of Management Sciences and in locating s...
متن کاملA population based hybrid metaheuristic for the p-median problem A population based hybrid metaheuristic for the p-median problem
The p-median problem is one of choosing p facilities from a set of candidates to satisfy the demands of n clients such that the overall cost is minimised. In this paper, PBS, a population based hybrid search algorithm for the p-median problem is introduced. The PBS algorithm uses a genetic algorithm based meta-heuristic, primarily based on cut and paste crossover operators, to generate new star...
متن کاملAn Efficient Hybrid Metaheuristic for Capacitated p-Median Problem
Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...
متن کاملA hybrid metaheuristic approach for the capacitated p-median problem
The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p medians considering distances and capacities for the services to be given by each median. This paper presents an efficient hybrid metaheuristic algorithm by combining a proposed cutting-plane neighborhood structure and a tabu search metaheuristic for the CPMP. In the proposed neighborhood structure to move from th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Computer Engineering
سال: 2012
ISSN: 2278-8727,2278-0661
DOI: 10.9790/0661-0710105